Genetic transposition inspired incremental genetic programming for efficient coevolution of locomotion and sensing of simulated snake-like robot

نویسندگان

  • Tüze Kuyucu
  • Ivan Tanev
  • Katsunori Shimohara
چکیده

Genetic transposition (GT) is a process of moving sequences of DNA to different positions within the genome of a single cell. It is recognized that the transposons (the jumping genes) facilitate the evolution of increasingly complex forms of life by providing the creative playground for the mutation where the latter could experiment with developing novel genetic structures without the risk of damaging the already existing, well-functioning genome. In this work we investigate the effect of a GT-inspired mechanism on the efficiency of genetic programming (GP) employed for coevolution of locomotion gaits and sensing of the simulated snake like robot (Snakebot). In the proposed approach, the task of coevolving the locomotion and the sensing morphology of Snakebot in a challenging environment is decomposed into two subtasks, implemented as two consecutive evolutionary stages. At first stage we employ GP to evolve a pool of simple, sensorless bots that are able to move fast in a smooth, open terrain. Then, during the second stage, we use these Snakebots to seed the initial population of the bots that are further subjected to coevolution of their locomotion control and sensing in a more challenging environment. For the second phase the seed is used as it is to create only part of a new individual, and the rest of the new individual’s genetic makeup is created by a mutant copy of the seed. Experimental results suggest that the proposed two-staged GT inspired incremental evolution contributes to significant increase in the efficiency of the evolution of fast moving and sensing Snakebots.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental evolution of fast moving and sensing simulated snake-like robot with multiobjective GP and strongly-typed crossover

In genetic programming (GP), most often the search space grows in a greater than linear fashion as the number of tasks required to be accomplished increases. This is a cause for one of the greatest problems in evolutionary computation; scalability. The aim of the work presented here is to facilitate the evolution of complex designs that have multiple features. We use a combination of mechanisms...

متن کامل

Evolution, Robustness, and Adaptation of Sidewinding Locomotion of Simulated Snake-Like Robot

Inspired by the efficient method of locomotion of the rattlesnake Crotalus cerastes, the objective of this work is automatic design through genetic programming, of the fastest possible (sidewinding) locomotion of simulated limbless, wheelless snake-like robot (Snakebot). The realism of simulation is ensured by employing the Open Dynamics Engine (ODE), which facilitates implementation of all phy...

متن کامل

Multiple-objective Optimization of Serpentine Locomotion with Snake Robot by Using the NSGA

This paper starts with developing kinematic and dynamic model of a snake shape robot in serpentine locomotion and finishes with actual experimentation. At the beginning the symmetrical and unsymmetrical serpenoid curves are introduced. Kinematics and dynamics of a snake robot on flat and inclined surfaces are obtained for a general n-link robot. SimMechanics toolbox of MATLAB software is employ...

متن کامل

Efficient Locomotion on Non-wheeled Snake-like Robots

This article presents our current work on studying energy efficient locomotion on crawling snake-like robots. The aim of this work is to use existing biological inspired methods to demonstrate lateral undulation planar gaits for efficiently controlling high-speed motion as a function of the terrain surface. A multilink non-wheeled snake-like robot is being developed for experimentation and anal...

متن کامل

International Journal of Mathematics and Computer Sciences (IJMCS) ISSN: 2305-7661 Vol.21 September 2013 International Scientific Researchers (ISR)

In this work we propose an approach for incorporating learning probabilistic context-sensitive grammar (LPCSG) in genetic programming (GP), employed for evolution and adaptation of locomotion gaits of a simulated snake-like robot (Snakebot). Our approach is derived from the original context-free grammar which usually expresses the syntax of genetic programs in canonical GP. Empirically obtained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011